Command Palette

Search for a command to run...

THIRD SEMESTERcoretheorySem 3

ALGORITHMS & DATA STRUCTURES

CSS 2106

Syllabus

  • 01Introduction - Pointers and Pointer Application
  • 02Accessing variables through pointers
  • 03pointers to pointers
  • 04pointer arithmetic and arrays
  • 05pointers and functions
  • 06Recursion- definition
  • 07recursive programs
  • 08efficiency of recursion
  • 09Stacks
  • 10queues
  • 11evaluation of expressions
  • 12multiple stacks and queues and its application
  • 13Linked lists representations- Singly
  • 14doubly
  • 15header node
  • 16circular along with the applications
  • 17Trees-Binary trees
  • 18representation
  • 19recursive/ non recursive inorder
  • 20preorder and post order tree traversal
  • 21level order traversal
  • 22Binary search tree
  • 23creation
  • 24insertion deletion operations on binary search tree
  • 25Additional Binary Tree Operations
  • 26Threaded Binary Tree and applications
  • 27Introduction to the concepts of Optimal Binary Search Trees
  • 28Fundamentals of Algorithms
  • 29Important Problem Types
  • 30Analysis of algorithm efficiency
  • 31Analysis Framework: Asymptotic Notations and Basic Efficiency Classes
  • 32Mathematical Analysis of Non-recursive and Recursive Algorithms
  • 33Brute force Techniques
  • 34Divide and Conquer
  • 35Decrease and Conquer: Insertion Sort
  • 36Depth First Search
  • 37Breadth First Search
  • 38Topological Sorting
  • 39Transform and Conquer: Presorting
  • 40BST
  • 41Heapsort
  • 42Space and Time tradeoffs: Input Enhancement in String Matching
  • 43Dynamic Programming: Warshall's and Floyd's Algorithms
  • 44The Knapsack Problem
  • 45Greedy Techniques: Prim's
  • 46Kruskal's and Dijkstra's Algorithm
  • 47Huffman Trees
  • 48Coping with limitations of algorithmic power
  • 49P, NP,and NP-complete Problems
  • 50Backtracking: n-Queens problem
  • 51Hamiltonian Circuit Problem
  • 52Subset-Sum Problem
  • 53Branch and Bound: Assignment Problem
  • 54Knapsack Problem
  • 55TSP

References

  • Behrouz A. Forouzan, Richard F. Gilberg, A Structured Programming Approach Using C, (3e), Cengage Learning India Pvt. Ltd, India, 2007
  • Ellis Horowitz, Sartaj Sahni, Susan Anderson and Freed, Fundamentals of Data Structures in C, (2e), Silicon Press, 2007
  • Richard F. Gilberg, Behrouz A. Forouzan, Data structures, A Pseudocode Approach with C, (2e), Cengage Learning India Pvt. Ltd, India, 2009
  • Tenenbaum Aaron M., Langsam Yedidyah, Augenstein Moshe J., Data structures using C, Pearson Prentice Hall of India Ltd., 2007
  • Debasis Samanta, Classic Data Structures, (2e), PHI Learning Pvt. Ltd., India, 2010
  • Anany Levitin, Introduction to the Design and Analysis of Algorithms, (3e), Pearson Education, 2011
  • Ellis Horowitz and Sartaj Sahni, Computer Algorithms/C++, (2e), University Press, 2007
  • Thomas H. Cormen, Charles E. Leiserson, Ronal L, Rivest, Clifford Stein, Introduction to Algorithms, (2e), PHI, 2006
Credits Structure
4Lecture
0Tutorial
0Practical
4Total